On a Kronecker products sum distance bounds
نویسنده
چکیده
Abstract— binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given. It is shown that some classic constructions are the private cases of considered one. The subclass of codes with equal lower and upper distance bounds is allocated. binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given. It is shown that some classic constructions are the private cases of considered one. The subclass of codes with equal lower and upper distance bounds is allocated.A
منابع مشابه
Decay Bounds for Functions of Matrices with Banded or Kronecker Structure
We present decay bounds for a broad class of Hermitian matrix functions where the matrix argument is banded or a Kronecker sum of banded matrices. Besides being significantly tighter than previous estimates, the new bounds closely capture the actual (non-monotonic) decay behavior of the entries of functions of matrices with Kronecker sum structure. We also discuss extensions to more general spa...
متن کاملDecay Bounds for Functions of Hermitian Matrices with Banded or Kronecker Structure
We present decay bounds for a broad class of Hermitian matrix functions where the matrix argument is banded or a Kronecker sum of banded matrices. Besides being significantly tighter than previous estimates, the new bounds closely capture the actual (non-monotonic) decay behavior of the entries of functions of matrices with Kronecker sum structure. We also discuss extensions to more general spa...
متن کاملEstimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates
The sensitivity of the algebraic (Kronecker) structure of rectangular matrix pencils to perturbations in the coefficients is examined. Eigenvalue perturbation bounds in the spirit of Bauer–Fike are used to develop computational upper and lower bounds on the distance from a given pencil to one with a qualitatively different Kronecker structure.
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0503038 شماره
صفحات -
تاریخ انتشار 2005